156 research outputs found
A unified approach to the performance analysis of caching systems
We propose a unified methodology to analyse the performance of caches (both
isolated and interconnected), by extending and generalizing a decoupling
technique originally known as Che's approximation, which provides very accurate
results at low computational cost. We consider several caching policies, taking
into account the effects of temporal locality. In the case of interconnected
caches, our approach allows us to do better than the Poisson approximation
commonly adopted in prior work. Our results, validated against simulations and
trace-driven experiments, provide interesting insights into the performance of
caching systems.Comment: in ACM TOMPECS 20016. Preliminary version published at IEEE Infocom
201
A large deviation approach to super-critical bootstrap percolation on the random graph
We consider the Erd\"{o}s--R\'{e}nyi random graph and we analyze
the simple irreversible epidemic process on the graph, known in the literature
as bootstrap percolation. We give a quantitative version of some results by
Janson et al. (2012), providing a fine asymptotic analysis of the final size
of active nodes, under a suitable super-critical regime. More
specifically, we establish large deviation principles for the sequence of
random variables with explicit rate
functions and allowing the scaling function to vary in the widest possible
range.Comment: 44 page
- …